A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence to a Second-order Point of a Trust-region Algorithm with a Nonmonotonic Penalty Parameter for Constrained Optimization Convergence to a Second-order Point of a Trust-region Algorithm with a Nonmonotonic Penalty Parameter for Constrained Optimization 1

A Abstract In a recent paper, the author (Ref. 1) proposed a trust-region algorithm for solving the problem of minimizing a non-linear function subject to a set of equality constraints. The main feature of the algorithm is that the penalty parameter in the merit function can be decreased whenever it is warranted. He studied the behavior of the penalty parameter and proved several global and loc...

متن کامل

A trust region algorithm for constrained optimization

We review the main techniques used in trust region algorithms for nonlinear constrained optimization. 1. Trust Region Idea Constrained optimization is to minimize a function subject to finitely many algebraic equation and inequality conditions. It has the following form

متن کامل

A New Trust-Region Algorithm for Equality Constrained Optimization

We present a new trust region algorithm for solving nonlinear equality constrained optimization problems. At each iterate a change of variables is performed to improve the ability of the algorithm to follow the constraint level sets. The algorithm employs L 2 penalty functions for obtaining global convergence. Under certain assumptions we prove that this algorithm globally converges to a point ...

متن کامل

A Trust Region Interior Point Algorithm for Linearly Constrained Optimization

We present an extension, for nonlinear optimization under linear constraints, of an algorithm for quadratic programming using a trust region idea introduced by Ye and Tse [Math. Programming, 44 (1989), pp. 157–179] and extended by Bonnans and Bouhtou [RAIRO Rech. Opér., 29 (1995), pp. 195–217]. Due to the nonlinearity of the cost, we use a linesearch in order to reduce the step if necessary. We...

متن کامل

A trust-region derivative-free algorithm for constrained optimization

We propose a trust-region algorithm for constrained optimization problems in which the derivatives of the objective function are not available. In each iteration, the objective function is approximated by a model obtained by quadratic interpolation, which is then minimized within the intersection of the feasible set with the trust region. Since the constraints are handled in the trust-region su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 1995

ISSN: 1052-6234,1095-7189

DOI: 10.1137/0805018